A Graphical Representation of Equivalence Classes of AMP Chain Graphs
نویسندگان
چکیده
This paper deals with chain graph models under alternative AMP interpretation. A new representative of an AMP Markov equivalence class, called the largest deflagged graph, is proposed. The representative is based on revealed internal structure of the AMP Markov equivalence class. More specifically, the AMP Markov equivalence class decomposes into finer strong equivalence classes and there exists a distinguished strong equivalence class among those forming the AMP Markov equivalence class. The largest deflagged graph is the largest chain graph in that distinguished strong equivalence class. A composed graphical procedure to get the largest deflagged graph on the basis of any AMP Markov equivalent chain graph is presented. In general, the largest deflagged graph differs from the AMP essential graph, which is another representative of the AMP Markov equivalence class.
منابع مشابه
Two Operations of Merging Components in a Chain Graph
Abstract In this paper we study two operations of merging components in a chain graph, which appear to be elementary operations yielding an equivalent graph in the respective sense. At first, we recall basic results on the operation of feasible merging components, which is related to classic LWF Markov equivalence of chain graphs. These results are used to get a graphical characterisation of fa...
متن کاملCharacterizing Markov Equivalence Classes for Amp Chain Graph Models
Indiana University and the University of Washington 2Chain graphs (CG) (= adicyclic graphs) use undirected and directed edges to represent simultaneously both structural and associative dependences.. Like acyclic directed graphs (ADGs), the CG associated with a given statistical model may not be unique, so CGs fall into Markov equivalence classes, which may be superexponentially large, leading ...
متن کاملLearning AMP Chain Graphs and some Marginal Models Thereof under Faithfulness: Extended Version
This paper deals with chain graphs under the Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. Moreover, we show that the extension of Meek’s conjecture to AMP chain graphs does not hold, which compromises the development of efficient and correct score+search lea...
متن کاملMarginal AMP Chain Graphs
We present a new family of graphical models that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them can be seen as the result of marginalizing out some nodes in an AMP chain graph. However, MAMP chain graphs do not only subsume AMP chain graphs but also regression chain graphs. We describe global and local Markov pr...
متن کاملOn Block Ordering of Variables in Graphical Modelling
In graphical modelling, the existence of substantive background knowledge on block ordering of variables is used to perform structural learning within the family of chain graphs (CGs) in which every block corresponds to an undirected graph and edges joining vertices in different blocks are directed in accordance with the ordering.We show that this practice may lead to an inappropriate restricti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Machine Learning Research
دوره 7 شماره
صفحات -
تاریخ انتشار 2006